The Positive Core for Games with Precedence Constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The positive core for games with precedence constraints∗

We generalize the characterizations of the positive core and the positive prekernel to TU games with precedence constraints and show that the positive core is characterized by non-emptiness (NE), boundedness (BOUND), covariance under strategic equivalence, closedness (CLOS), the reduced game property (RGP), the reconfirmation property (RCP) for suitably generalized Davis-Maschler reduced games,...

متن کامل

The bounded core for games with precedence constraints

An element of the possibly unbounded core of a cooperative game with precedence constraints belongs to its bounded core if any transfer to a player from any of her subordinates results in payoffs outside the core. The bounded core is the union of all bounded faces of the core, it is nonempty if the core is nonempty, and it is a continuous correspondence on games with coinciding precedence const...

متن کامل

Characterizations of solutions for games with precedence constraints

We generalize the characterizations of the positive core and the positive prekernel to TU games with precedence constraints and show that the positive core is characterized by non-emptiness (NE), boundedness (BOUND), covariance under strategic equivalence, closedness (CLOS), the reduced game property (RGP), the reconfirmation property (RCP) for suitably generalized Davis-Maschler reduced games,...

متن کامل

Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs

This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...

متن کامل

The Restricted Core for totally positive games with ordered players

Recently, applications of cooperative game theory to economic allocation problems have gained popularity. In many such allocation problems, such as river games, queueing games and auction games, the game is totally positive (i.e., all dividends are nonnegative), and there is some hierarchical ordering of the players. In this paper we introduce the Restricted Core for such games with ordered pla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2014

ISSN: 1556-5068

DOI: 10.2139/ssrn.2431605